Parallel Standard ML with Skeletons

نویسندگان

Norman Scaife

Greg J. Michaelson

Susumu Horiguchi

چکیده

We present an overview of our system for automatically extracting parallelism from Standard ML programs using algorithmic skeletons. This system identifies a small number of higher-order functions as sites of parallelism and the compiler uses profiling and transformation techniques to exploit these.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

متن کامل

Parallel Functional Island Model Genetic Algorithms through Nested Algorithmic Skeletons

Island model genetic algorithms(GAs) are based on independent GAs which evolve separately, and intermittently exchange genetic material. Such models may be expressed as nested higher-order functions and realised as the corresponding nested algorithmic skeletons. Here we consider the use of an island model GA for the Traveling Salesperson Problem(TSP) in the evaluation of our parallelising compi...

متن کامل

Empirical Parallel Performance Prediction from Semantics-Based Profiling

The PMLS parallelizing compiler for Standard ML is based upon the automatic instantiation of algorithmic skeletons at sites of higher order function (HOF) use. Rather than mechanically replacing HOFs with skeletons, which in general leads to poor parallel performance, PMLS seeks to predict run-time parallel behaviour to optimise skeleton use. Static extraction of analytic cost models from progr...

متن کامل